An efficient simulation algorithm on Kripke structures
نویسندگان
چکیده
منابع مشابه
A More Efficient Simulation Algorithm on Kripke Structures
A number of algorithms for computing the simulation preorder (and equivalence) on Kripke structures are available. Let Σ denote the state space, the transition relation and Psim the partition of Σ induced by simulation equivalence. While some algorithms are designed to reach the best space bounds, whose dominating additive term is |Psim|, other algorithms are devised to attain the best time com...
متن کاملAN EFFICIENT OPTIMIZATION PROCEDURE BASED ON CUCKOO SEARCH ALGORITHM FOR PRACTICAL DESIGN OF STEEL STRUCTURES
Different kinds of meta-heuristic algorithms have been recently utilized to overcome the complex nature of optimum design of structures. In this paper, an integrated optimization procedure with the objective of minimizing the self-weight of real size structures is simply performed interfacing SAP2000 and MATLAB® softwares in the form of parallel computing. The meta-heuristic algorithm chosen he...
متن کاملWeighted Branching Simulation Distance for Parametric Weighted Kripke Structures
Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters (Cassting’16/SynCoP’16). EPTCS 220, 2016, pp. 63–75, doi:10.4204/EPTCS.220.6 c © L. Foshammer, K.G Larsen & A. Mariegaard This work is licensed under the Creative Commons Attribution License. Weighted Branching Simulation Distance for Parametric Weighted Kripke Struc...
متن کاملCSP and Kripke Structures
A runtime verification technique has been developed for CSP via translation of CSP models to Kripke structures. With this technique, we can check that a system under test satisfies properties of traces and refusals of its CSP model. This complements analysis facilities available for CSP and for all languages with a CSP-based semantics: Safety-Critical Java, Simulink, SysML, and so on. Soundness...
متن کاملConcurrent Kripke Structures
We consider a class of Kripke Structures in which the atomic propositions are events. This enables us to represent worlds as sets of events and the transition and satisfaction relations of Kripke structures as the subset and membership relations on sets. We use this class, called event Kripke structures, to model concurrency. The obvious semantics for these structures is a true concurrency sema...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2014
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-014-0195-9